Local Search Proximal Algorithms as Decision Dynamics with Costs to Move
نویسندگان
چکیده
منابع مشابه
Local search proximal algorithms as decision dynamics with costs to move
Acceptable moves for the “worthwhile-to-move” incremental principle are such that “advantages to move” are higher than some fraction of “costs-to-move”. When combined with optimization, this principle gives raise to adaptive local search proximal algorithms. Convergence results are given in two distinctive cases, namely low local costs-to-move and high local costs-to-move. In this last case, on...
متن کاملA Hybrid Algorithm using Firefly, Genetic, and Local Search Algorithms
In this paper, a hybrid multi-objective algorithm consisting of features of genetic and firefly algorithms is presented. The algorithm starts with a set of fireflies (particles) that are randomly distributed in the solution space; these particles converge to the optimal solution of the problem during the evolutionary stages. Then, a local search plan is presented and implemented for searching s...
متن کاملComputer Go: Knowledge, Search, and Move Decision
This paper intends to provide an analytical overview of the research performed in the domain of computer Go. Domain knowledge that is essential to Go-playing programs is identified. Various computation and search techniques that can be used effectively to obtain helpful domain knowledge are presented. Four different move-decision paradigms applied by today’s leading Go programs are discussed. C...
متن کاملForm Dynamic Programming To Search Algorithms With Functional Costs
In this paper we approach, using artificial intelligence methods, the problem of finding a minimal-cost path in a functionally weighted graph, i.e a graph with monotone cost functions associated with the arcs This problem is important since solving any system of functional equations in a general dynamic programming formulation can be shown equivalent to it. A general heuristic search algorithm ...
متن کاملParallel Local Search Algorithms
In general, neural networks are regarded as models for massively parallel computation. But very often, this parallelism is rather limited, especially when considering symmetric networks. For instance, Hoppeld networks do not really compute in parallel as their updating algorithm always requires sequential execution. We describe a recurrent network corresponding to a symmetric network and introd...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Set-Valued and Variational Analysis
سال: 2010
ISSN: 1877-0533,1877-0541
DOI: 10.1007/s11228-010-0139-7